Bounds on a graph's security number
نویسندگان
چکیده
منابع مشابه
Some lower bounds for the $L$-intersection number of graphs
For a set of non-negative integers~$L$, the $L$-intersection number of a graph is the smallest number~$l$ for which there is an assignment of subsets $A_v subseteq {1,dots, l}$ to vertices $v$, such that every two vertices $u,v$ are adjacent if and only if $|A_u cap A_v|in L$. The bipartite $L$-intersection number is defined similarly when the conditions are considered only for the ver...
متن کاملBounds on Sum Number in Graphs
A simple undirected graph G is called a sum graph if there is a labeling L of the vertices of G into distinct positive integers such that any two vertices u and v of G are adjacent if and only if there is a vertex w with label L(w) = L(u) + L(v). The sum number (H) of a graph H = (V; E) is the least integer r such that graph G consisting of H and r isolated vertices is a sum graph. It is clear ...
متن کاملBounds on the restrained Roman domination number of a graph
A {em Roman dominating function} on a graph $G$ is a function$f:V(G)rightarrow {0,1,2}$ satisfying the condition that everyvertex $u$ for which $f(u) = 0$ is adjacent to at least one vertex$v$ for which $f(v) =2$. {color{blue}A {em restrained Roman dominating}function} $f$ is a {color{blue} Roman dominating function if the vertices with label 0 inducea subgraph with no isolated vertex.} The wei...
متن کاملBounds on Sum Number in Graphs Hiroshi
A simple undirected graph G is called a sum graph if there is a labeling L of the vertices of G into distinct positive integers such that any two vertices u and v of G are adjacent if and only if there is a vertex w with label L(w) = L(u) + L(v). The sum number (H) of a graph H = (V; E) is the least integer r such that graph G consisting of H and r isolated vertices is a sum graph. It is clear ...
متن کاملsome lower bounds for the $l$-intersection number of graphs
for a set of non-negative integers~$l$, the $l$-intersection number of a graph is the smallest number~$l$ for which there is an assignment of subsets $a_v subseteq {1,dots, l}$ to vertices $v$, such that every two vertices $u,v$ are adjacent if and only if $|a_u cap a_v|in l$. the bipartite $l$-intersection number is defined similarly when the conditions are considered only for the ver...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2008
ISSN: 0166-218X
DOI: 10.1016/j.dam.2007.08.037